waiting time improvement in human queues by using first-best customer priority rule algorithm
نویسندگان
چکیده
in this paper we introduced a new priority rule algorithm in human queues. the suggested method is applicable in human lines with different demands (serving times) for different customers. in this method, the waiting time for each customer is related to the volume of demand. a common example of such a system is a bakery line. the usual priority rule algorithm in this kind of queue is first-in-first-out where its waiting time is not optimal. in this new priority rule algorithm, the login time is saved for each customer and for choosing the customer for the service at each turn, the ratio of waiting time to the service time is calculated for each customer, and the customer with the highest value of this ratio is selected for the service. a mathematical model was extracted to simulate the algorithm and the model indicated that waiting time could be optimized up to 25%. in addition, in our case study the waiting time was reduced by 20 % after the implementation of the algorithm. another advantage of our approach is the prediction of waiting time by an intuitive method. moreover, the volume of demand is regulated automatically by using this algorithm. this algorithm was developed in a queue ordering system and the results are presented. the result proved the advantages of this algorithm. the customer satisfaction was also measured that showed improvements.
منابع مشابه
Time Dependent Priority Queues
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...
متن کاملWaiting time characteristics in cyclic queues
In this paper we study a single-server queue with FIFO service and cyclic interarrival and service times. An efficient approximative algorithm is developed for the first two moments of the waiting time. Numerical results are included to demonstrate that the algorithm yields accurate results. For the special case of exponential interarrival times we present a simple exact analysis.
متن کاملSelf-Selecting Priority Queues with Burr Distributed Waiting Costs
Service providers, in the presence of congestion and heterogeneity of customer waiting costs, often introduce a fee-based premier option using which the customers selfsegment themselves. Examples of this practice are found in health care (concierge medicine), amusement parks, government (consular services), and transportation. Using a single-server queuing system with customer waiting costs mod...
متن کاملQueues with waiting time dependent service
Motivated by service levels in terms of the waiting-time distribution seen, for instance, in call centers, we consider two models for systems with a service discipline that depends on the waiting time. The first model deals with a single server that continuously adapts its service rate based on the waiting time of the first customer in line. In the second model, one queue is served by a primary...
متن کاملPriority Queues and Dijkstra ’ s Algorithm ∗
We study the impact of using different priority queues in the performance of Dijkstra’s SSSP algorithm. We consider only general priority queues that can handle any type of keys (integer, floating point, etc.); the only exception is that we use as a benchmark the DIMACS Challenge SSSP code [1] which can handle only integer values for distances. Our experiments were focussed on the following: 1....
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
مهندسی صنایعجلد ۴۶، شماره ۱، صفحات ۳۹-۵۱
کلمات کلیدی
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023